99 9 Signed Shape Tilings of Squares ∗
نویسنده
چکیده
Let T be a tile made up of finitely many rectangles whose corners have rational coordinates and whose sides are parallel to the coordinate axes. This paper gives necessary and sufficient conditions for a square to be tilable by finitely many Qweighted tiles with the same shape as T , and necessary and sufficient conditions for a square to be tilable by finitely many Z-weighted tiles with the same shape as T . The main tool we use is a variant of F.W.Barnes’s algebraic theory of brick packing, which converts tiling problems into problems in commutative algebra.
منابع مشابه
Signed shape tilings of squares
Let T be a tile made up of finitely many rectangles whose corners have rational coordinates and whose sides are parallel to the coordinate axes. This paper gives necessary and sufficient conditions for a square to be tilable by finitely many Qweighted tiles with the same shape as T , and necessary and sufficient conditions for a square to be tilable by finitely many Z-weighted tiles with the sa...
متن کامل2 9 D ec 2 00 6 Complex Tilings ∗
We study the minimal complexity of tilings of a plane with a given tile set. We note that any tile set admits either no tiling or some tiling with O(n) Kolmogorov complexity of its (n× n)squares. We construct tile sets for which this bound is tight: all (n × n)-squares in all tilings have complexity Ω(n). This adds a quantitative angle to classical results on non-recursivity of tilings – that w...
متن کاملSpaces of Domino Tilings
We consider the set of all tilings by dominoes (2 1 rectangles) of a surface, possibly with boundary, consisting of unit squares. Convert this set into a graph by joining two tilings by an edge if they diier by a ip, i.e., a 90 rotation of a pair of side-by-side dominoes. We give a criterion to decide if two tilings are in the same connected component, a simple formula for distances and a metho...
متن کاملCounting Colorful Tilings of Rectangular Arrays
In this paper we give recursive formulas for the number of colorful tilings of small rectangular arrays. We enumerate the tilings of a 2 × n board with painted squares, dominoes, and I-trominoes. We also provide a recursion formula for the number of tilings of a 3 × n board with colorful squares and dominoes. Finally, we describe a general method for calculating the number of colorful tilings o...
متن کاملOn the number of tilings of the rectangular board with T-tetronimoes
The classical combinatorial problem of counting domino tilings of a 2n × 2m rectangle was solved by P.W. Kasteleyn and also by H.N.V. Temperley and M.E. Fisher in 1961. We shall consider the similar problem for T-tetrominoes, that is, pieces formed by 4 unit squares in the shape of a T. We give explicit formulae for the number of tilings with T-tetrominoes for the 4n × 4m rectangle when n = 1, ...
متن کامل